matrix deflation

См. также в других словарях:

• Deflation (Mathematik) — Deflation bezeichnet eine Technik aus der numerischen Mathematik, mit der eine Matrix in Blockdreiecksform gebracht wird, so dass das Spektrum von A gerade die Vereinigung der Spektren der Diagonalblöcke ist. Inhaltsverzeichnis 1… …   Deutsch Wikipedia

• QR-Algorithmus — Der QR Algorithmus ist ein numerisches Verfahren zur Berechnung aller Eigenwerte und eventuell der Eigenvektoren einer quadratischen Matrix. Das auch QR Verfahren oder QR Iteration genannte Verfahren basiert auf der QR Zerlegung und wurde im… …   Deutsch Wikipedia

• Penrose tiling — A Penrose tiling is a nonperiodic tiling generated by an aperiodic set of prototiles named after Roger Penrose, who investigated these sets in the 1970s.Because all tilings obtained with the Penrose tiles are non periodic, Penrose tilings are… …   Wikipedia

• Business and Industry Review — ▪ 1999 Introduction Overview        Annual Average Rates of Growth of Manufacturing Output, 1980 97, Table Pattern of Output, 1994 97, Table Index Numbers of Production, Employment, and Productivity in Manufacturing Industries, Table (For Annual… …   Universalium

• Yield curve — This article is about yield curves as used in finance. For the term s use in physics, see Yield curve (physics). Not to be confused with Yield curve spread – see Z spread. The US dollar yield curve as of February 9, 2005. The curve has a typical… …   Wikipedia

• Eigenvalues and eigenvectors — For more specific information regarding the eigenvalues and eigenvectors of matrices, see Eigendecomposition of a matrix. In this shear mapping the red arrow changes direction but the blue arrow does not. Therefore the blue arrow is an… …   Wikipedia

• Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… …   Wikipedia

• QR algorithm — In numerical linear algebra, the QR algorithm is an eigenvalue algorithm; that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR transformation was developed in 1961 by John G.F. Francis (England) and by Vera N.… …   Wikipedia

• Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is …   Wikipedia

• Divide-and-conquer eigenvalue algorithm — Divide and conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such… …   Wikipedia

• Jenkins-Traub algorithm — The Jenkins Traub algorithm for polynomial zeros is a fast globally convergent iterative method. It has been described as practically a standard in black box polynomial root finders .Given a polynomial P ,:P(z)=sum {i=0}^na iz^{n i}, quad a… …   Wikipedia